Algorithmic Decidability of Engel's Property for Automaton Groups
نویسنده
چکیده
We consider decidability problems associated with Engel’s identity ([· · · [[x, y], y], . . . , y] = 1 for a long enough commutator sequence) in groups generated by an automaton. We give a partial algorithm that decides, given x, y, whether an Engel identity is satisfied. It succeeds, importantly, in proving that Grigorchuk’s 2-group is not Engel. We consider next the problem of recognizing Engel elements, namely elements y such that the map x 7→ [x, y] attracts to {1}. Although this problem seems intractable in general, we prove that it is decidable for Grigorchuk’s group: Engel elements are precisely those of order at most 2. Our computations were implemented using the package Fr within the computer algebra system Gap.
منابع مشابه
Synchronized Product of Semi-Algebraic O-Minimal Hybrid Automata
This paper addresses questions regarding the decidability of hybrid automata that may be constructed hierarchically and in a modular way, as is the case in many exemplar systems, be it natural or engineered. Since the basic fundamental step in such constructions is a product operation, which constructs a new product hybrid automaton by combining two simpler component hybrid automata, an essenti...
متن کاملAlgebraic Characterization of the Finite Power Property
We give a transparent characterization, by means of a certain syntactic semigroup, of regular languages possessing the finite power property. Then we use this characterization to obtain a short elementary proof for the uniform decidability of the finite power property for rational languages in all monoids defined by a confluent regular system of deletion rules. This result in particular covers ...
متن کاملNon-Uniform Cellular Automata: classes, dynamics, and decidability
The dynamical behavior of non-uniform cellular automata is compared with the one of classical cellular automata. Several differences and similarities are pointed out by a series of examples. Decidability of basic properties like surjectivity and injectivity is also established. The final part studies a strong form of equicontinuity property specially suited for non-uniform cellular automata.
متن کاملOn the rational subset problem for groups
We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through free products amalgamated over finite subgroups and HNN extensions with finite associated subgroups. We provide a simple proof of a result of Grunschlag showing...
متن کاملVariations of Checking Stack Automata: Obtaining Unexpected Decidability Properties
We introduce a model of one-way language acceptors (a variant of a checking stack automaton) and show the following decidability properties: 1. The deterministic version has a decidable membership problem but has an undecidable emptiness problem. 2. The nondeterministic version has an undecidable membership problem and emptiness problem. There are many models of accepting devices for which ther...
متن کامل